Construction of flexible type II and III QC-LDPC codes
نویسندگان
چکیده
Type II and III low-density parity-check codes (QC-LDPC) codes have been shown to have better minimum distance compared to Type I QC-LDPC codes. This article presents a highly flexible method for constructing high-girth type II and III QC-LDPC codes. The proposed algorithm establishes constraints to be observed in creating a bipartite graph of a given girth. The algorithm is by far more flexible in constructing a wide range (rates and lengths) of type II and III QC-LDPC codes compared to existing methods. Although the proposed algorithm uses a search approach to construct codes, it generally successfully constructs a code even at low code lengths. Constructed codes show better bit error rate performances compared to type I codes as expected.
منابع مشابه
A Graphical Model and Search Algorithm Based Quasi-Cyclic Low-Density Parity-Check Codes Scheme
A constant challenge in Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes lies on flexible code lengths and rates, conditioned by good error performance. This paper presents an optimal construction method of QC-LDPC Codes on the basis of graphical model and search algorithm. Utilizing the proposed scheme, we can construct adaptable QC-LDPC codes whose girths are no less than 12, and column ...
متن کاملAn Unnoticed Strong Connection Between Algebraic-Based and Protograph-Based LDPC Codes, Part II: Nonbinary Case and Code Construction
This paper is the second part of a series of two papers on the investigation of the connection between two methods for constructing LDPC codes, namely the superposition and the protograph-based methods. In the first part, by taking the graph point of view, we established a strong connection between these two construction methods and showed that, in the binary case, the protograph-based construc...
متن کاملUpper Bounds on the Minimum Distance of Quasi-Cyclic LDPC codes Revisited
In this paper we investigate the minimum code distance of QC LDPC codes [1], [2], [3]. These codes form an important subclass of LDPC codes [4], [5]. These codes also are a subclass of protograph-based LDPC codes [6]. QC LDPC codes can be easily stored as their parity-check matrices can be easily described. Besides such codes have efficient encoding [7] and decoding [8] algorithms. All of these...
متن کاملConstruction and Performance Analysis of BIBD-QC-LDPC Codes for Correcting Erasure-Bursts
This paper presents a novel approach for constructing structured regular QC-LDPC codes based on a special type of combinatorial designs,known as the balanced incomplete block design (BIBD).The code design approach based on the technology of block cyclic shift and dispertion (BCSD) for correcting erasure-bursts over the binary bursts erasure channel (BBEC). Furthermore, the Tanner graph of the c...
متن کاملImproving the Rao-Nam secret key cryptosystem using regular EDF-QC-LDPC codes
This paper proposes an efficient joint secret key encryption-channel coding cryptosystem, based on regular Extended Difference Family Quasi-Cyclic Low-Density Parity-Check codes. The key length of the proposed cryptosystem decreases up to 85 percent using a new efficient compression algorithm. Cryptanalytic methods show that the improved cryptosystem has a significant security advantage over Ra...
متن کامل